Specifying useful error bounds for geometry tools: an intersector exemplar

نویسندگان

  • C. Mow
  • Thomas J. Peters
  • Neil F. Stewart
چکیده

The problem of geometric robustness is pervasive within CAGD. One aspect is to permit convenient user specification of error bounds, so as to ensure the usefulness of geometric models. Often, a useful specification requires an additional interface between the user and the geometric tool. As intersections of spline surface patches are fundamental within CAGD, we present a relation between model space and parameter space error bounds for an intersection algorithm as an exemplar of the additional interface needed for practical geometric tools. In particular, we consider the approximation of the intersection curve between two trimmed-surface patches. The Grandine-Klein intersector produces an approximation that is accurate to within a user-specified error bound, where that error bound is specified in parameter space. However, the end user is typically unaware of the details of this parametric domain, so selection of a parametric space error bound often relies upon heuristics. In this note our goal is to demonstrate how a user-specified error bound is made usable in practice through the straightforward application of the mathematical relation between model-space and parameter-space error bounds. The conversion of the model-space tolerance into a parameter-space tolerance is captured in a preprocessing interface to the intersection algorithm. The software implemented has proven to be reliable, efficient and user-friendly. It is based upon an elementary error analysis, which is also presented. 1 All three authors acknowledge, with gratitude, funding in partial support of this work from the National Science Foundation, under grant Numbers DMS-9985802 and DMS-0138098. The research of the third author was also supported in part by a grant from the Natural Sciences and Engineering Research Council of Canada. The views expressed herein are of the authors, not of these sponsors. Preprint submitted to Elsevier Science March 27, 2003

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Model-space bounds for the Grandine-Klein intersector

Geometric-modeling systems with trimmed-surface patches typically store multiple representations of the same geometric information, and these representations may be inconsistent. This is true in particular for approximations of the intersection curve between two trimmed-surface patches. The Grandine-Klein intersector provides an error bound in parameter space for each computed approximation of ...

متن کامل

Improving Exemplar-based Image Completion methods using Selecting the Optimal Patch

Image completion is one of the subjects in image and video processing which deals with restoration of and filling in damaged regions of images using correct regions. Exemplar-based image completion methods give more pleasant results than pixel-based approaches. In this paper, a new algorithm is proposed to find the most suitable patch in order to fill in the damaged parts. This patch selection ...

متن کامل

Mapping the Region of Entropic Vectors with Support Enumeration & Information Geometry

The region of entropic vectors is a convex cone that has been shown to be at the core of many fundamental limits for problems in multiterminal data compression, network coding, and multimedia transmission. This cone has been shown to be non-polyhedral for four or more random variables, however its boundary remains unknown for four or more discrete random variables. Methods for specifying probab...

متن کامل

An approach to fault detection and correction in design of systems using of Turbo ‎codes‎

We present an approach to design of fault tolerant computing systems. In this paper, a technique is employed that enable the combination of several codes, in order to obtain flexibility in the design of error correcting codes. Code combining techniques are very effective, which one of these codes are turbo codes. The Algorithm-based fault tolerance techniques that to detect errors rely on the c...

متن کامل

Error bounds in approximating n-time differentiable functions of self-adjoint operators in Hilbert spaces via a Taylor's type expansion

On utilizing the spectral representation of selfadjoint operators in Hilbert spaces, some error bounds in approximating $n$-time differentiable functions of selfadjoint operators in Hilbert Spaces via a Taylor's type expansion are given.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Aided Geometric Design

دوره 20  شماره 

صفحات  -

تاریخ انتشار 2003